Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
نویسندگان
چکیده
منابع مشابه
Graph partitioning algorithms for optimizing software deployment in mobile cloud computing
As cloud computing is gaining popularity, an important question is how to optimally deploy software applications on the offered infrastructure in the cloud. Especially in the context of mobile computing where software components could be offloaded from the mobile device to the cloud, it is important to optimize the deployment, by minimizing the network usage. Therefore we have designed and eval...
متن کاملEfficient Data Mining with Evolutionary Algorithms for Cloud Computing Application
With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...
متن کاملOptimizing Offloading Strategies in Mobile Cloud Computing
We consider a dynamic offloading problem arising in the context of mobile cloud computing (MCC). In MCC, three types of tasks can be identified: (i) those which can be processed only locally in a mobile device, (ii) those which are processed in the cloud, and (iii) those which can be processed either in the mobile or in the cloud. For type (iii) tasks, it is of interest to consider when they sh...
متن کاملOptimizing the Deployment of Software in the Cloud
We present the genetic algorithm CDOXplorer that explores the cloud deployment options search space on the basis of automatically extracted architectural models and approximates the corresponding pareto optimum. Migrating existing enterprise software systems to new programming platforms constitutes a great challenge [HBG08]. Additionally, migrating to cloud platforms involves the comparison of ...
متن کاملGraph Partitioning Algorithms with Applications to Scientific Computing Graph Partitioning Algorithms
Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a speciied number of subsets such that few edges join two vertices in diierent subsets. Several new graph partitioning al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Future Generation Computer Systems
سال: 2013
ISSN: 0167-739X
DOI: 10.1016/j.future.2012.07.003